Edge Expansion of Cubical Complexes
نویسنده
چکیده
In this paper we show that graphs of “neighbourly” cubical complexes – cubical complexes in which every pair of vertices spans a (unique) cube – have good expansion properties, using a technique based on multicommodity flows. By showing that graphs of stable set polytopes are graphs of neighbourly cubical complexes we give a new proof that graphs of stable set polytopes have edge expansion 1.
منابع مشابه
A Convexity Lemma and Expansion Procedures for Bipartite Graphs
A hierarchy of classes of graphs is proposed which includes hypercubes, acyclic cubical complexes, median graphs, almost-median graphs, semi-median graphs and partial cubes. Structural properties of these classes are derived and used for the characterization of these classes by expansion procedures, for a characterization of semi-median graphs by metrically defined relations on the edge set of ...
متن کاملSimplicial and Cubical Complexes: Analogies and Differences
The research summarized in this thesis consists essentially of two parts. In the first, we generalize a coloring theorem of Baxter about triangulations of the plane (originally used to prove combinatorially Brouwer's fixed point theorem in two dimensions) to arbitrary dimensions and to oriented simplicial and cubical pseudomanifolds. We show that in a certain sense no other generalizations may ...
متن کاملCombinatorial Groupoids, Cubical Complexes, and the Lovász Conjecture
A foundation is laid for a theory of combinatorial groupoids, allowing us to use concepts like “holonomy”, “parallel transport”, “bundles”, “combinatorial curvature” etc. in the context of simplicial (polyhedral) complexes, posets, graphs, polytopes and other combinatorial objects. A new, holonomy-type invariant for cubical complexes is introduced, leading to a combinatorial “Theorema Egregium”...
متن کاملO ct 2 00 5 Combinatorial groupoids , cubical complexes , and the Lovász conjecture
A foundation is laid for a theory of combinatorial groupoids, allowing us to use concepts like “holonomy”, “parallel transport”, “bundles”, “combinatorial curvature” etc. in the context of simplicial (polyhedral) complexes, posets, graphs, polytopes and other combinatorial objects. A new, holonomy-type invariant for cubical complexes is introduced, leading to a combinatorial “Theorema Egregium”...
متن کاملOn simplicial and cubical complexes with short links
We consider closed simplicial and cubical n-complexes in terms of link of their (n−2)faces. Especially, we consider the case, when this link has size 3 or 4, i.e., every (n − 2)face is contained in 3 or 4 n-faces. Such simplicial complexes with short (i.e. of length 3 or 4) links are completely classified by their characteristic partition. We consider also embedding into hypercubes of the skele...
متن کامل